Method, apparatus and system for dispatching messages within a system

ABSTRACT

In one embodiment, the present invention is a method of dispatching information within a system. The method includes receiving a message. The method also includes extracting address information from the message. The method further includes determining a destination from the address information. The method also includes routing the message to the destination.

CLAIM OF DOMESTIC PRIORITY

This application is a continuation-in-part of application Ser. No.10/211,442, entitled “METHOD, APPARATUS AND SYSTEM FOR DISPATCHING,TRANSFORMING, CONVERTING AND PROCESSING MESSAGES BETWEEN MULTIPLESYSTEMS WITH OPTIONAL CUSTOMIZATION” and filed on Aug. 2, 2002 now U.S.Pat. No. 7,506,068. Application Ser. No. 10/211,442 claims priority topreviously filed provisional applications having Ser. No. 60/316,385,entitled “METHOD, APPARATUS AND SYSTEM FOR DISPATCHING, TRANSFORMING,CONVERTING AND PROCESSING MESSAGES BETWEEN MULTIPLE SYSTEMS” and filedon Aug. 30, 2001 and having Ser. No. 60/341,943, entitled “METHOD,APPARATUS AND SYSTEM FOR DISPATCHING, TRANSFORMING, CONVERTING ANDPROCESSING MESSAGES BETWEEN MULTIPLE SYSTEMS WITH OPTIONALCUSTOMIZATION” and filed on Dec. 18, 2001.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention relates to database technology generally and morespecifically to synchronization and transfer of information betweenmultiple databases of varying form.

2. Description of the Related Art

As will be understood, it has long been known that multiple databasesmay include different versions of the same information. Furthermore,databases may be structured such that it is expected that the databasewill have outdated information relative to another database, the seconddatabase may be expected to own the information and provide updates tothe first database.

Transferring such information and updates may be problematic when thefirst and second database do not share the same schema or are managed bydifferent systems. Therefore, it would be valuable to be able to providea method or apparatus for transferring information between databaseswithout depending on identical internal structures for example.

Furthermore, systems may be expected to receive a variety of types ofinformation, bound for a variety of distinct destinations within thesystem. However, determining where the information is bound is notnecessarily transparent, and providing a method or system to make suchdeterminations may be useful.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and notlimitation in the accompanying figures.

FIG. 1 illustrates an embodiment of transaction processing.

FIG. 2 illustrates an embodiment of data transformation engineprocessing.

FIG. 3 illustrates an embodiment of converter processing.

FIG. 4 illustrates an alternate embodiment of converter processing.

FIG. 5 illustrates an alternate embodiment of data transformation engineprocessing.

FIG. 6 illustrates an alternate embodiment of transaction processing.

FIG. 7 illustrates an embodiment of message dispatch.

FIG. 8 illustrates an embodiment of message origination.

FIG. 9 illustrates an embodiment of processing received message(s).

FIG. 10 illustrates an embodiment of a dispatch system or medium.

FIG. 11 illustrates an embodiment of two systems linked together.

FIG. 12 illustrates an embodiment of a medium.

FIG. 13 illustrates an alternate embodiment of a dispatch system ormedium.

FIG. 14 illustrates another alternate embodiment of a dispatch system ormedium.

FIG. 15 illustrates yet another alternate embodiment of a dispatchsystem or medium.

FIG. 16 illustrates another alternate embodiment of transactionprocessing.

FIG. 17 illustrates another alternate embodiment of data transformationengine processing.

FIG. 18 illustrates another alternate embodiment of converterprocessing.

FIG. 19 illustrates yet another alternate embodiment of converterprocessing.

FIG. 20 illustrates yet another alternate embodiment of datatransformation engine processing.

FIG. 21 illustrates yet another alternate embodiment of transactionprocessing.

FIG. 22 illustrates another embodiment of message dispatch.

DETAILED DESCRIPTION

A method, apparatus and system for dispatching, transforming, convertingand processing messages between multiple systems with optionalcustomization is described. In the following description, for purposesof explanation, numerous specific details are set forth in order toprovide a thorough understanding of the invention. It will be apparent,however, to one skilled in the art that the invention can be practicedwithout these specific details. In other instances, structures anddevices are shown in block diagram form in order to avoid obscuring theinvention. Where reference numbers are utilized, like reference numbersrefer to similar or identical components.

Reference in the specification to “one embodiment” or “an embodiment”means that a particular feature, structure, or characteristic describedin connection with the embodiment is included in at least one embodimentof the invention. The appearances of the phrase “in one embodiment” invarious places in the specification are not necessarily all referring tothe same embodiment, nor are separate or alternative embodimentsmutually exclusive of other embodiments.

In one embodiment, the present invention is a method of sending changeinformation from a first database to a second database. The methodincludes managing a set of transactions to produce a first message. Themethod also includes transforming the first message into a secondmessage. The method further includes converting the second message intoa transmittable message.

In an alternate embodiment, the present invention is a method ofreceiving change information for a second database from a firstdatabase. The method includes converting a received message into asecond message. The method further includes transforming the secondmessage into a third message. The method also includes processing thethird message to form a set of transactions. The method may furtherinclude effecting changes in the second database with the set oftransactions.

In another alternate embodiment, a process for sending messagesincorporating changes or updates to a database is described. The processincludes processing transactions in a database to create a message. Theprocess further includes processing the message to conform to datatransformation engine specifications. The process also includesprocessing the message to convert the message into a transmittable form.The process may also include transmitting the message.

In still another alternate embodiment, a process for receiving messagesincorporating changes or updates to a database is described. The processincludes processing the message to convert the message from atransmittable form to an internally usable form. The process furtherincludes processing the message based on data transformation enginespecifications. The process also includes processing transactions in adatabase from data included in the message. The process may also includereceiving the message.

In yet another alternative embodiment, a process for dispatchingreceived messages within a system is described. The process includesreceiving a message, identifying a type of the message, and dispatchingthe message to a destination based on the type of the message. Theprocess may include consultation of a set of rules to determine the typeof the message and/or to determine a proper or desired destination forthe message.

In yet another alternate embodiment, an optionally customizable processfor sending messages incorporating changes or updates to a database isdescribed. The process includes processing transactions in a database tocreate a message. The process further includes processing the message toconform to data transformation engine specifications. The process alsoincludes processing the message to convert the message into atransmittable form. The process may also include transmitting themessage. Each portion of the process may be either customized orachieved in a default manner.

In an alternate embodiment, an optionally customizable process forreceiving messages incorporating changes or updates to a database isdescribed. The process includes processing the message to convert themessage from a transmittable form to an internally usable form. Theprocess further includes processing the message based on datatransformation engine specifications. The process also includesprocessing transactions in a database from data included in the message.The process may also include receiving the message. Again, each portionof the process may be either customized or may proceed withoutcustomization.

Note that reference is made to transformation and reformatting ofmessages. Typically this refers to massaging the message based onpre-defined rules which may be customized according to the use of themethods. The messages may include data which represents transactions orchanges within a database, and may have that data wrapped in other datamaking the message suitable for transfer or transmission for example.

One embodiment of a method of assembling a message involves transforminga set of transactions from a database into an XML format message. Aswill be appreciated, tags may be embedded in the message which would notbe appropriate for processing in a database system but which mayfacilitate identification of the message and/or its transactioncontents. Moreover, the transactions may need values substituted inbased on a new database, or placeholders for values specific to an olddatabase, such as foreign key values which may vary from system tosystem or database to database. Thus, transforming the message mayinclude both substitution between values and placeholders on each endand embedding or stripping of tags, headers, envelopes, and otherartifacts associated with processing or transmission of a message.

In an alternate embodiment, customization overrides may allow forassembly into a generally non-supported or proprietary format for theresulting message. Such customization will replace, rather thansupplement, default processing which results in the message in question.Furthermore, as will be appreciated, alternate embodiments may relate toprocessing or transforming a message into transactions which may be usedto replicate changes to a first database in a second database.

FIG. 1 illustrates an embodiment of transaction processing. At block110, changes, such as those in a database, are found for processingpurposes. These changes may encompass all changes since a previoustransaction processing event, or may be defined in some other wayappropriate to capturing information deemed desirable by a systemdesigner or manager. At block 120, all of the changes found aretranslated into commands and tags are attached as needed for eachcommand. The tags attached may be useful in future processing of themessage by providing formatting cues and either providing pointers to orencoding in the tag conversion rule sets for the commands.

At block 130, a record ID associated with each command is found—arecords which was changed (or would change) as a result of the commandin question. At block 140, the method for each command is invoked withrespect to a set of objects relative to the record found at block 130.Thus, the commands corresponding to transactions are effectivelyexecuted on a record changed in the transactions. The objects inquestion are those within the database in which the transactionsoccurred. At block 150, the results of the commands are packaged into amessage, with some massaging or transformation as may be available inthe process of capturing the results.

At block 160, a determination is made as to whether another record IDexists which was affected by the transactions in question. If so, thatrecord ID is found at block 130 as before. If not, a determination ismade as to whether another message needs to be generated at block 170.If so, the process returns to block 110 to find changes in the database.If not, the process terminates at block 180.

FIG. 2 illustrates an embodiment of data transformation engineprocessing. At block 210, a next (or first) part of an old(untransformed) message is found. At block 220, a determination is madeas to whether this is the end of the message. If so, at block 280, theprocess terminates with pass-through of the end of the message or asuitable end for the transformed message.

If not, at block 230, the sub-message part found at block 210 isidentified as either being a body part, a header part, or an unknownpart. If the sub-message part is either a header or unknown part, it isprocessed at block 235, typically by passing through the informationfrom the untransformed to the transformed message, although otherprocessing (even discard of the data) may be specified.

If the sub-message part is the body of the message, at block 237, thebody is traversed until a first sub-part of the body is found.Typically, this sub-part will correspond either to a command or to anend of the body, although it may correspond to some unrecognized portionof the body, too. At block 240, a determination is made as to whetherthe end of the body has been reached. If so, the process returns toblock 210 to find the next part of the message.

If not, a determination is made as to whether a command has been foundat block 250. If so, the command is transformed based on pre-definedrules at block 260. If not, the non-command portion is passed throughuntouched at block 265. At block 270, the either transformed command oruntransformed non-command portion are packaged into the transformedmessage, and the process then returns to continue traversing to the nextsub-part of the body.

FIG. 3 illustrates an embodiment of converter processing. At block 310,the next (or first) message to be converted is found. At block 315, adetermination is made as to whether an envelope is required. Thisdetermination may be based on the format of the message found, or basedon requirements of the destination for the message for example. At block320, if an envelope is necessary, the envelope and any associatedheaders are generated for the message. If no envelope is necessary, orafter the envelope is generated, custom pre-processing of the messagemay occur at block 325. This is an optional part of the process,allowing for customization by a system manager for example throughspecification of rules or formats for messages, and need not beimplemented to achieve the desired result in all cases.

At block 330, a transaction within the message is processed according topre-defined rules to make it ready for transmission. At block 335, thedata objects associated with the transaction are similarly processedaccording to pre-defined rules. As will be appreciated, this processingmay be specified in a variety of ways. However, it will be appreciatedthat the processing in question will typically involve processingmaterial made available from a data transformation engine process forpurposes of transmission through a transmission apparatus such as amessage queue or other transport mechanism.

At block 340, a determination is made as to whether another transactionremains unprocessed. If so, the process returns to block 330. If not, adetermination is made as to whether an envelope is present, such as anenvelope generated at block 320. If so, the processed transactions areattached to the envelope at block 355. After attaching the processedtransactions to the envelope, or if no envelope is present, the message(consisting of either an envelope with transactions attached or a set oftransactions) is provided with processing instructions to be used by arecipient of the message at block 360. At block 370, the message isassembled, including transactions, attached envelope if present, and anyappropriate processing instructions, and the message is made availablefor transmission or transfer.

At block 380, a determination is made as to whether more messages needto be processed. If not, the process terminates at block 390. If so, theprocess returns to block 310 to find the next message.

FIG. 4 illustrates an alternate embodiment of converter processing. Atblock 410, the next (or first) message received is found. At block 415,any custom message processing, such as that specified by a systemmanager for example, is performed. At block 420, presence of an envelopeis detected. If the envelope is present, at block 425, the envelope andassociated headers are processed. After processing the envelope, or ifno envelope is present, at block 430, further custom transactionprocessing may be specified by a system manager for example and thenperformed. Note that typically the custom processing would be specifiedprior to processing, and pre-defined rules within the specificationswould determines whether such custom processing occurs.

At block 435, a next (or first) transaction within the message is found.At block 440, the transaction is processed, transforming it from aformat suitable for transmission or transfer into a format suitable, forexample, for use in data transformation engine processing. At block 450,a next (or first) object associated with the transaction is found. If anobject is determined to have been found at block 460, the process movesto block 465, and the object is processed, such as by transforming itfrom a format suitable for transmission or transfer into a formatsuitable, for example, for use in data transformation engine processing.

If no object was found, a determination is made at block 470 as towhether further transactions are to be found in the message. If yes,then the process returns to block 435 and the next transaction is found.If no, a determination is made as to whether an envelope is associatedwith the message at block 475. If so, the processed objects andtransactions are attached to the envelope as processed at block 425. Ifnot, or after attachment to the envelope, another opportunity for customprocessing is allowed at block 485. Finally, the processed message isassembled at block 490 and is made available to the rest of the system.

At block 495, a determination is made as to whether more messages areavailable for processing. If not, the process terminates at block 497.If so, the process returns to block 410 and the next message to beprocessed is found.

FIG. 5 illustrates an alternate embodiment of data transformation engineprocessing. At block 510, an envelope of a message is processed(transformed according to a pre-defined set of rules) if the envelope ispresent. At block 520, the next portion of the message (following anyattached envelope for example) is found. At block 525, a determinationis made as to whether the end of the message has been found. If so, atblock 530, the process terminates, and the message has been transformedto the extent expected based on the data transformation engine process.

If the end of the message has not been found, at block 540, the portionof the message found is identified. If the portion is found to be eithera header portion or an unknown portion, then that portion is processedat block 545. However, this processing at block 545, in one embodiment,may simply include passing through the header or unknown portion. Theprocess then proceeds to block 520 and the next portion of the messageis found.

If a body portion of the message is determined to be the portion found,then at block 555, a determination is made as to whether the end of thebody has been found. If so, the process proceeds to block 520 and thenext portion of the message is found. If not (the end of the body hasnot been found), then at block 565 a determination is made as to whetherthe sub-part of the body found is a command. If so, the transactionrelated to the command is found and processed at block 575. If not, thesub-part of the body is passed through at block 570. All parts of thebody are then packaged into a new format based on pre-defined rules forrepackaging at block 580. At block 585, the next section of the body(the next sub-part) is found, and then the process proceeds to block555.

FIG. 6 illustrates an alternate embodiment of transaction processing. Atblock 610, a next (or first) portion of a message is found. At block620, a determination is made as to whether commands within the messageremain unprocessed. If all commands have been processed, the nextportion of the message is the end of the message, so the processterminates at block 690.

If commands remain to be processed, then at block 630, a determinationis made as to whether the portion of the message found at block 610 is acommand. If it is not, then the portion of the message is passed throughat block 625, and the process returns to block 610 to find the nextportion of the message.

If the portion of the message is a command, an opportunity for customprocessing of commands based on a pre-defined set of rules is providedat block 640. Such custom processing may be specified by a systemmanager for example. At block 650, the command is processed against areceiving database, and at block 660, a method of an objectcorresponding to the command is invoked for records in the receivingdatabase, thereby effecting the change to be caused by the command. Atblock 670, the return from the method (the result of the command) ispackaged, and the process then flows to block 610 to find the nextportion of the message. In capturing the returns from the method, theprocess may also invoke the execution method for the appropriate object,thereby generating a response message to the sending external system.

FIG. 7 illustrates an embodiment of message dispatch. The processillustrated can be described as follows. First, a message is received.Then, processing instructions within the message are identified anddecoded. Next, an envelope is identified and decoded. In the process,headers for messages within the envelope are also decoded.

The pre-defined rules for processing the message are parsed into tokensand placed into a hash tree or other suitable data structure.Separately, the transactions in the command hierarchy of the message areprocessed and accessed against the rule sets stored in the hash tree.The processed message is then sent to the appropriate part of the systemfor use therein.

At block 710, the next message received is found. At block 715,processing instructions within the message are detected, and at block720, such processing instructions, if present, are tagged and identifiedfor use by the receiver of the message. At block 725, a determination ismade as to whether an envelope is present in the message. If so, atblock 730, the envelope and any associated headers are tagged, allowingfor ease of identification of these portions of the message in laterprocessing. At block 740, a rules data structure for processing themessage is created, such as a hash tree of objects against which thecontents of the message may be matched. The rules data structure may bebased on a pre-defined set of rules which determine how messages, orexpected messages, are to be processed.

At block 750, the next (or first) transaction (or portion) of themessage is found. At block 755, a determination is made as to whetherthe transaction is valid, for a valid transaction, processing progressesto block 760, for an invalid transaction it reverts to block 750. Atblock 760, a determination is made as to whether the transaction matchesa rule of the rules data structure, thus indicating that a known methodfor processing the transaction exists within the system in question. Atblock 765, a known transaction has its structure of objects traversed,with tags or values inserted or substituted into the structure tofacilitate processing based on the matched rule. At block 775, errordetection for the known transaction occurs. At block 770, a transactionor portion which does not match any known rules is tagged as an unknownportion.

At block 780, a determination is made as to whether transactions remainto be processed. If so, the process then proceeds to block 750. If not,the process proceeds to block 790 where the message is assembled andtransferred to its destination within the system. At block 795, adetermination is made as to whether more messages are present forprocessing. If so, the process returns to block 710 to find the nextmessage. If not, the process terminates at block 797.

Note that with respect to FIGS. 1-7, custom processing has beendiscussed for various blocks. Such custom processing would depend onsoftware or repository (database) configuration. As an illustrativeexample, a user-defined field may have a particular format which is notsupported by normal processing and would thus tend to causeunpredictable or erroneous behavior in the normal processing of themessages. However, by configuring the software or database to properlyhandle the field, the processing for that field may be customized, suchthat a date field with an unusual format may be properly handled withoutlosing information for example. Such configuration may be achievedwithout requiring the software to resort to external sources ofinformation or code (scripts or libraries for example) beyond what wouldnormally be accessed simply to process the data, namely the originalcode and configuration information of the software and the informationin the database.

FIG. 8 illustrates an embodiment of message origination. At block 810,transaction management, as may be illustrated in FIG. 1 for exampleoccurs, resulting in a set of components. At block 820, processing fordata transformation engine purposes occurs as may be illustrated in FIG.2 for example, resulting in a well-formed message. At block 830,converter processing occurs, in which the well-formed message istransformed into a message suitable for transmission such as may beillustrated in FIG. 3 for example. At block 840, the message is providedto an external system (or systems) through a transport mechanism ormodule. A transport mechanism in this context may be implemented as someform of HTTP transport protocol mechanism or module, as a message queuesuch as an MQ available from IBM for example, or through other knownmethods and apparatuses.

FIG. 9 illustrates an embodiment of processing received message(s). Atblock 910, the message is received from a transport mechanism or module.At block 920, dispatch processing such as that described with respect toFIG. 7 occurs. At block 930, converter processing of the message,determining how to process the message occurs, such as that which may beillustrated in FIG. 4 for example. At block 940, transaction processingof the transactions in the message such as that which may be illustratedin FIG. 5 occurs. At block 950, changes in the receiving database areeffected through processing such as that which may be illustrated inFIG. 6 occurs.

FIG. 10 illustrates an embodiment of a dispatch system or medium. Block1010 represents an input interface with an external system, such as aninterface to a message queue, an HTTP socket, or other suitable inputinterface. Block 1020 is a dispatch module which receives messages fromblock 1010 and decodes the messages. Block 1020 may be expected toretrieve a source and destination from an incoming message. Based onthis decoding, using rules in block 1030, the dispatch module 1020 thenprovides the message to a first application 1040 or a second application1050. Thus, block 1020 may be expected to match the retrieved sourceand/or destination against rules of block 1030 to determine anappropriate destination within the system in question, such as firstapplication 1040 or second application 1050 for example. Moreover, onlyone of the source and destination encoded in the message may benecessary to determine an appropriate destination within the system.

As will be appreciated, this exemplary description may be generalized toa variety of different applications for example. For example, a layer1035 may exist between dispatch module 1020 and the applications (1040,1050). The layer 1035 may automatically route messages to a destinationbased on flags or other signals set by dispatch module 1020 afterprocessing of the message(s) in question. Implementation of the layer1035 may occur through a variety of different well-known techniques.Furthermore, in one embodiment, the rules of block 1030 may beimplemented as a fixed set of rules, compiled prior to use by block1020. It will be appreciated that various methods of handling theserules may be appropriate.

FIG. 11 illustrates an embodiment of two systems linked together. Afirst system 1105 includes a first database 1110. A link 1125 links thefirst system 1105 to a second system 1115 including a second database1120. The link 1125 may be implemented at one level as an MQ messagequeue for example, and messages may be exchanged between the firstdatabase 1110 and the second database 1120 for purposes of communicatinginformation or synchronizing information within the databases (1110 and1120).

In one embodiment, a dispatch system determines a destination withineither the first system 1105 or the second system 1115 for messagesreceived over the link 1125. Furthermore, in one embodiment, aconverter-transformation-transaction chain (such as that illustrated inFIGS. 4, 5, and 6 respectively for example) may be used to transform areceived message into changes within the database (either 1110 or 1120)of the receiving system. Similarly, in one embodiment, atransaction-transformation-converter chain (such as that illustrated inFIGS. 1, 2, and 3 respectively for example) may be used to transform aset of changes within the database (either 1110 or 1120) into a messagefor the transmitting or transferring system. Note that the message astransmitted or transferred within the system may be a set of messages,having diverse destinations, formats, and contents.

FIG. 12 illustrates an embodiment of a medium. The medium 1200 includesa converter module 1210 (such as one corresponding to the converters ofFIG. 3 or 4 for example). The medium 1200 also includes a datatransformation engine module 1220 (such as one corresponding to the datatransformation engine modules of FIG. 2 or 5 for example). The medium1200 also includes a transaction manager 1230 (such as one correspondingto the transaction managers of FIG. 1 or 6 for example). As describedbelow, this may be a machine readable medium embodying instructions forexecution on a processor, which, when executed by the processor, causethe processor and an associated system or machine to perform a method.

FIG. 13 illustrates an alternate embodiment of a dispatch system ormedium. As illustrated, the embodiment of FIG. 13 adds theadministrative interface of block 1360 to the embodiment of FIG. 10. Theadministrative interface of block 1360 may be used to initially set ormodify the rules of block 1030 which govern the dispatch module of block1020. Furthermore, it will be appreciated that modification of the rulesof block 1030 may be achieved in a dynamic or real-time manner, allowingfor changes in behavior of the system according to needs or preferenceswhich similarly change.

FIG. 14 illustrates another alternate embodiment of a dispatch system ormedium. At block 1410, rules for processing messages are received. Atblock 1420, a message is received, such as from a message queue or HTTPinterface for example. At block 1430, the message is processed anddispatched to an appropriate destination within the system. At block1440, a determination is made as to whether the rules received in block1410 have been updated or otherwise changed. If so, the process returnsto block 1410, and new rules are received. If not, the process returnsto block 1420, and the next message is processed based on the currentset of rules.

FIG. 15 illustrates yet another alternate embodiment of a dispatchsystem or medium. At block 1510, a message is received. At block 1520,the message address information, such as a source and or destination forthe message for example, are processed. This processing may involveretrieving the information in question from the message (such as frompredefined fields for example) or otherwise determining a source and/ordestination. At block 1530, the message destination within the system(which may or may not be identical to the destination retrieved from themessage) is determined, based on the results of block 1520 and anyprocessing rules which may be available for interpreting those results.Note that such processing rules may include a default destination withinthe system for messages which do not otherwise have an identifiabledestination within the system. At block 1540, the message is actuallyrouted to the destination in question. This may or may not include anysource and/or destination information, as that information may bestripped from the message during processing.

The next section illustrates a variation on the embodiments presentedwith respect to FIGS. 1, 2, 3, 4, 5, 6 and 7, which may be used withembodiments illustrated with respect to FIGS. 8, 9, 10, 11, 12, 13, 14and 15, among other embodiments. Each of the embodiments illustrated inFIGS. 16, 17, 18, 19, 20, 21, and 22 vary from the embodiments of FIGS.1-7 through the use of script customization which is exclusive of oradditive to any default aspects of the embodiment.

Generally, several aspects apply to customization. First, a basic orvanilla connector (set of transformation, converting and processingroutines) is configured, much as any software may be initiallyconfigured. Next, the behavior of the connector is configured throughuser-definable properties, as discussed previously with respect to FIGS.1-7. Then, custom scripts are provided to further configure (alter) theconnector to process data in a manner generally different from defaultor preset processing methods. Finally, the connector is operated usingthe custom scripts. This may further involve additional specification ofinformation, such as locations or other address information for thecustom scripts, configuration of control information for the connectorsuitable to include the scripts, configuration of data transformationmaps, configuration of workflow information for the connector, orcompilation of information about custom scripts into the connector.Thus, while customization with respect to FIGS. 1-7 involvedconfiguration of software or databases for example, customization withrespect to FIGS. 16-22 involves custom scripts which may overridedefault of configured processing.

FIG. 16 illustrates another alternate embodiment of transactionprocessing. As will be appreciated, most of the blocks in thisillustration have already been described with respect to FIG. 1.However, blocks 1620 and 1650 illustrate variations peculiar to someembodiments. At block 1620, changes are translated into commands andtags are attached as necessary. This may be achieved in a defaultmanner, such as that corresponding to block 120. However, it may also becustomized through use of a script developed by someone using orcontrolling the system. The script in question may be provided with aname or location such that it may be located during processing of thecommands, and the script may be expected to include suitable routinesfor translating changes into commands and attaching tags. Thus, thescript may be used to customize the transaction processing to take intoaccount proprietary formats, unusual data, and other issues notaddressed by standard transaction processing. Similarly, at block 1650,results of commands are packaged and massaged as necessary. Such a blockmay be effectively replaced by a custom script, thereby allowing fordifferent behavior in the processing block. For both of these blocks(1620, 1650), either a default process may occur, or a custom script maybe used, with each being exclusive of the other. Note also that noprovision is made for additional customized or user-defined processing.

FIG. 17 illustrates another alternate embodiment of data transformationengine processing. As will be appreciated, most of the blocks in thisillustration have already been described with respect to FIG. 2.However, blocks 1755 and 1760 illustrate variations peculiar to someembodiments. At block 1755, custom command transformation occurs, suchas massaging of the command as with respect to block 260 of FIG. 2, orthrough use of a custom script in a manner similar to that with respectto block 1620. At block 1760, the command is transformed, in a mannersimilar to transformation with respect to block 260 of FIG. 2, butwithout any massaging. In some embodiments, this occurs as it would withblock 260, namely the process is predefined. In some alternateembodiments, a custom script is used in its place, in a manner similarto that in block 1620. Thus, the custom scripts may be expected tohandle command transformation and custom command transformation, but ina manner defined by a user or controller of the system, rather than themanner provided for through default processing. Furthermore, the customscripts may be expected to be exclusionary to the default processing,and may be the only customization allowed.

FIG. 18 illustrates another alternate embodiment of converterprocessing. As will be appreciated, most of the blocks in thisillustration have already been described with respect to FIG. 3.However, blocks 1820, 1825, 1832 and 1860 illustrate variations peculiarto some embodiments. At block 1820, either the envelope and headers aregenerated in a default manner, or by a replacement custom script. Atblock 1825, either the transaction is processed in a default mannerbased on the configuration of the software, or by a replacement customscript. Similarly, at blocks 1832 and 1860, data objects are processedand processing instructions are generated in either a default manner(which may be influenced by configuration for block 1832) or through useof a custom script. In this way, customization is allowed, but alsolimited to a predictable and controlled portion of the process.

FIG. 19 illustrates yet another alternate embodiment of converterprocessing. As will be appreciated, most of the blocks in thisillustration have already been described with respect to FIG. 4.However, blocks 1915, 1925, 1930, 1937, 1962 and 1985 illustratevariations peculiar to some embodiments. At block 1915, messageprocessing occurs, either by default manner or by custom script. Atblock 1925, envelopes and headers are found and processed, either by adefault process or through use of a custom script. Similarly, at blocks1930 and 1937, transaction processing occurs either by default (withpossible configuration overrides) or by custom script. This may use thesame or two different custom scripts for example. At block 1962, theobject in question is either processed in a default manner (withconfiguration overrides if appropriate) or through use of a customscript. Finally, at block 1985, the final processing is carried outeither in a default manner or through use of a custom script. Note thatthe customization at block 1985 may be in the form of a NO-OP ornon-operative script to eliminate this block, and similar opportunitiesexist for other blocks.

FIG. 20 illustrates yet another alternate embodiment of datatransformation engine processing. As will be appreciated, most of theblocks in this illustration have already been described with respect toFIG. 5. However, blocks 2010, 2067, 2075 and 2080 illustrate variationspeculiar to some embodiments. At each of blocks 2010, 2067, 2075, and2080, the expected processing may be handled by either a default processor through use of a custom script. Similarly, FIG. 21 illustrates yetanother alternate embodiment of transaction processing. As will beappreciated, most of the blocks in this illustration have already beendescribed with respect to FIG. 6. However, blocks 2140 and 2170illustrate variations peculiar to some embodiments. As will beappreciated, each of blocks 2140 and 2170 may utilize either a defaultprocess or a custom script. Also, FIG. 22 illustrates another alternateembodiment of message dispatch. As will be appreciated, most of theblocks in this illustration have already been described with respect toFIG. 7. However, blocks 2220, 2230, 2262 and 2265 illustrate variationspeculiar to some embodiments. Each of these blocks may similarly involveeither of a default process or a custom script.

Some portions of the detailed description are presented in terms ofalgorithms and symbolic representations of operations on data bitswithin a computer memory. These algorithmic descriptions andrepresentations are the means used by those skilled in the art to mosteffectively convey the substance of their work to others skilled in theart. An algorithm as described here is generally conceived to be a selfconsistent sequence of acts or operations leading to a desired result.The acts are those requiring physical manipulations of physicalquantities. Usually, though not necessarily, these quantities take theform of electrical or magnetic signals capable of being stored,transferred, combined, compared and otherwise manipulated. It has provenconvenient at times principally for reasons of common usage to refer tothese signals as bits, values, elements, symbols, characters, terms,numbers, data or the like.

It should be borne in mind, however, that all of these in similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise as apparent from the following discussionit is appreciated that throughout the description discussions utilizingterms such as “processing” or “computing” or “calculating” or“determining” or “displaying” or the like refer to the action andprocesses of a computer system or similar electronic computing devicethat manipulates and transforms data represented as physical(electronic) quantities within the computer systems registers andmemories into other data similarly represented as physical quantitieswithin the computer system memories or registers or other suchinformation storage transmission or display devices. The presentinvention can be implemented by an apparatus for performing theoperations herein. This apparatus may be specially constructed for therequired purposes or it may comprise a machine such as a general purposecomputer selectively activated or reconfigured by a computer programstored in the computer. Such a computer program may be stored in amachine readable storage medium such as but not limited to any type ofdisk including floppy disks, optical disks, CD roms and magnetic opticaldisks, read only memories, random access memories, EPROMS, EEPROMS,magnetic or optical cards or any type of media suitable for storingelectronic constructions and each coupled to a computer system bus. Eachof these media may be coupled to a computer system bus through use of anappropriate device for reading and or writing the media in question.Specialty apparatus may include a collection of readily available piecesor an application specific integrated circuit including a series oflogic blocks for example. The blocks of FIG. 7, 8, 9 or 12 may besuitable for implementation as logic blocks, as may other configurationsof the method, system and apparatus described herein.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general purposesystems may be used with programs in accordance with the teachingsherein or it may prove convenient to construct more specializedapparatus to perform the required method. For example, any of themethods according to the present invention can be implemented in hardwired circuitry by programming a general purpose processor or by anycombination of hardware and software. One of skill in the art willimmediately appreciate that the invention can be practiced with computersystem configuration. Configurations other than those described belowincluding hand held devices, multi processor systems, microprocessorbased or programmable consumer electronics, network PCs, mini computers,main frame computers and the like. The invention may also be practicedin distributed computing environments or tasks or performed by remoteprocessing devices that are linked through a communications network. Therequired structure for a variety of these systems will appear from thedescription below.

The methods of the invention may be implemented using computer software.If written in a programming language conforming to a recognized standardsequences of instructions designed to implement the methods can becompiled for execution on a variety of hardware platforms or machinesand for interface to a variety of operating systems. In addition thepresent invention is not described with reference to any particularprogramming language. It will be appreciated that a variety ofprogramming languages may be used to implement the teachings ofinvention as described herein. Furthermore, it is common in the art tospeak of software in one form or another (for example program procedureapplication etc. . . . ) as taken in action or causing a result. Suchexpressions are merely a shorthand way of saying that execution of thesoftware by a computer causes the processor of the computer to performan action or produce a result.

In the foregoing detailed description, the method and apparatus of thepresent invention has been described with reference to specificexemplary embodiments thereof. It will, however, be evident that variousmodifications and changes may be made thereto without departing from thebroader spirit and scope of the present invention. In particular, theseparate blocks of the various block diagrams represent functionalblocks of methods or apparatuses and are not necessarily indicative ofphysical or logical separations or of an order of operation inherent inthe spirit and scope of the present invention. For example, the variousblocks of FIG. 12 may be integrated into components, or may besubdivided into components. Similarly, the blocks of FIG. 8 (forexample) represent portions of a method which, in some embodiments, maybe reordered or may be organized in parallel rather than in a linear orstep-wise fashion. The present specification and figures are accordinglyto be regarded as illustrative rather than restrictive.

1. A method of dispatching information within a computer system,comprising: receiving at the computer system a message comprising aplurality of transactions, wherein the plurality of transactions relatesto a plurality of changes, respectively, in a first database having afirst database schema, wherein the plurality of transactions comprisefirst and second transactions for first and second applications,respectively; creating a rules data structure for processing thereceived message; determining that the first and second transactions arevalid; in response to determining that the first transaction is valid,determining that the first transaction matches a first rule of the rulesdata structure, which indicates that a first method for processing thefirst transaction exists; in response to determining that the secondtransaction is valid, determining that the second transaction matches asecond rule of the rules data structure, which indicates that a secondmethod for processing the second transaction exists; tagging andinserting values into the first transaction to facilitate processing ofthe first transaction based on the first rule; tagging and insertingvalues into the second transaction to facilitate processing of thesecond transaction based on the second rule; extracting source ordestination address information from the plurality of transactions ofthe message; routing the first and second transactions of the message tothe first and second applications, respectively based on the extractedsource or destination address information; the first and secondapplications effecting changes in a second database using the pluralityof transactions, wherein the second database has a second databaseschema, wherein the first database schema is different from the seconddatabase schema.
 2. The method of claim 1 further comprising: convertingthe message into a second message; transforming the second message intoa third message; and processing the third message to form a transformedset of transactions.
 3. The method of claim 1 further comprising:converting the message into a second message using custom scripts anddefault processing; transforming the second message into a third messageusing custom scripts and default processing; and processing the thirdmessage to form a transformed set of transactions using custom scriptsand default processing.
 4. The method of claim 1 further comprising:detecting errors in the message.
 5. The method of claim 1 furthercomprising: providing additional information to the first or secondapplications.
 6. The method of claim 5 wherein: additional informationincludes transformation map information.
 7. The method of claim 5wherein: additional information includes transaction operationinformation.
 8. The method of claim 5 wherein: additional informationincludes an internal representation of data hierarchy information of themessage.
 9. The method of claim 8 wherein: the internal representationis configurable based on the set of rules.
 10. A method of dispatchingmessages in a computer system, comprising: receiving at the computersystem a message comprising a plurality of transactions including firstand second transactions for first and second applications, respectively,wherein the plurality of transactions relates to a plurality of changes,respectively, in a first database having a first database schema;retrieving source or destination addresses from the message; creating arules data structure comprising first and second rules; comparing eachof the plurality of transactions to the rules of the data structure todetermine if the transaction matches a rule of the data structure;tagging and inserting values in the first and second transactions inorder to facilitate processing of the first and second transactionsbased on the first and second rules; assembling the message; andtransferring the assembled message to a system that comprises the firstand second applications based the source or destination addresses; thefirst and second applications effecting changes in a second databaseusing the first and second transactions, respectively, wherein thesecond database has a second database schema, wherein the first databaseschema is different from the second database schema.
 11. The method ofclaim 10, further comprising: determining whether an envelope ispresent; and tagging the envelope and any associated headers.
 12. Themethod of claim 11, further comprising: determining whether processinginstructions are present in the message; and tagging the processinginstructions.
 13. The method of claim 12, further comprising:determining that a third transaction of the plurality of transactionsdoes not match any rule of the rules data structure; and tagging thethird transaction as unknown; and wherein transferring the assembledmessage comprises transferring the third transaction to a defaultdestination responsive to the tagging as unknown.
 14. The method ofclaim 10 further comprising: receiving the set of rules.
 15. The methodof claim 14 further comprising: detecting changes in the set of rules.16. The method of claim 10 further comprising: converting the messageinto a second message; transforming the second message into a thirdmessage; and processing the third message to form a transformedplurality of transactions.
 17. The method of claim 10 furthercomprising: converting the message into a second message using customscripts and default processing; transforming the second message into athird message using custom scripts and default processing; andprocessing the third message to form a transformed plurality oftransactions using custom scripts and default processing.
 18. The methodof claim 10 further comprising: validating the message.
 19. The methodof claim 18 wherein: validating the message includes determining if eachtransaction of the plurality of transactions is supported by the system.20. The method of claim 10 further comprising: detecting errors in themessage.
 21. The method of claim 10 further comprising: providingadditional information to the first or second applications.
 22. Themethod of claim 21 wherein: additional information includestransformation map information.
 23. The method of claim 21 wherein:additional information includes transaction operation information. 24.The method of claim 21 wherein: additional information includes aninternal representation of data hierarchy information of the message.25. The method of claim 24 wherein: the internal representation isconfigurable based on the set of rules.
 26. A machine-readable storagemedium embodying instructions, which, when executed by a processor,cause the processor to perform a method, the method comprising:receiving a message comprising a plurality of transactions includingfirst and second transactions for first and second applications,respectively, wherein each of the transactions relates to changes,respectively, in a first database having a first database schema;creating a rules data structure for processing the message; determiningthat the first and second transactions are valid; in response todetermining that the first transaction is valid, determining that thefirst transaction matches a first rule of the rules data structure,which indicates that a first method for processing the first transactionexists within a system that comprises the first and second applications;in response to determining that the second transaction is valid,determining that the second transaction matches a second rule of therules data structure, which indicates that a second method forprocessing the second transaction exists within the system; extractingsource or destination address information from the message; tagging andinserting values into the first transaction to facilitate processing ofthe first transaction based on the first rule; tagging and insertingvalues into the second transaction to facilitate processing of thesecond transaction based on the second rule; routing the first andsecond transactions to the first and second applications, respectively,of a system based on the extracted source or destination addressinformation; the first and second applications effecting changes in asecond database using the plurality of transactions, wherein the seconddatabase has a second database schema, wherein the first database schemais different from the second database schema.
 27. The machine-readablestorage medium of claim 26 further embodying instructions which, whenexecuted by the processor, further cause the processor to perform themethod further comprising: converting the message into a second message;transforming the second message into a third message; and processing thethird message to form a set of transactions.
 28. The machine-readablestorage medium of claim 26 further embodying instructions which, whenexecuted by the processor, further cause the processor to perform themethod further comprising: converting the message into a second messageusing custom scripts and default processing; transforming the secondmessage into a third message using custom scripts and defaultprocessing; and processing the third message to form a set oftransactions using custom scripts and default processing.
 29. The methodof claim 1 further comprising: receiving the processing rules; parsingthe processing rules; storing the processing rules as objects in therules data structure; and comparing the transactions against the objectsin the rules data structure.
 30. The method of claim 29 furthercomprising: determining that a third transaction of the plurality oftransactions does not have an identifiable destination; routing thethird transaction to a default destination included in the processingrules.
 31. The method of claim 30 further comprising: removing from themessage that portion of the message which comprises the source anddestination address information.
 32. The method of claim 31 furthercomprising: identifying each sub-part of the message as one of a bodypart, a header part, and an unknown part.